Manipulating the edge of instability
نویسندگان
چکیده
منابع مشابه
Manipulating the edge of instability.
We investigate the integration of visual and tactile sensory input for dynamic manipulation. Our experimental data and computational modeling reveal that time-delays are as critical to task-optimal multisensory integration as sensorimotor noise. Our focus is a dynamic manipulation task "at the edge of instability." Mathematical bifurcation theory predicts that this system will exhibit well-clas...
متن کاملElectrostatic Edge Instability of Lipid Membranes
cell ghosts (Steck et. al., Science 168:255(1970)). Lipid membranes, the sheets which form the boundaries of cells, must maintain their integrity for cells to live [1]. Since a tear in a membrane exposes the hydrophobic interior of the sheet to water, tradition maintains that membranes have a high line tension (energy per unit length of exposed edge) and never spontaneously form holes. We show ...
متن کاملManipulating topological edge spins in a one-dimensional optical lattice.
We propose to observe and manipulate topological edge spins in a one-dimensional optical lattice based on currently available experimental platforms. Coupling the atomic spin states to a laser-induced periodic Zeeman field, the lattice system can be driven into a symmetry protected topological (SPT) phase, which belongs to the chiral unitary (AIII) class protected by particle number conservatio...
متن کاملChapter 7 CONTROLLING NEUROLOGICAL DISEASE AT THE EDGE OF INSTABILITY
Rapid advances in technology are making the dream of treating human neurological diseases with implanted electronic devices a reality. The more such devices are able to exploit the properties of intrinsic neural control mechanisms, the more effective they will be in re-establishing control in the setting of disease. Noise and time delays are ubiquitous features of the nervous system. Three obse...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biomechanics
سال: 2007
ISSN: 0021-9290
DOI: 10.1016/j.jbiomech.2007.01.022